6 research outputs found

    A unification-based natural language interface to a database.

    Get PDF
    An implementation of a Lexical Functional Grammar (LFG) natural language front-end to a database is presented, and its capabilities demonstrated by reference to a set of queries used in the Chat-80 system. The potential of LFG for such applications is explored. Other grammars previously used for this purpose are briefly reviewed and contrasted with LFG. The basic LFG formalism is fully described, both as to its syntax and semantics, and the deficiencies of the latter for database access application shown. Other current LFG implementations are reviewed and contrasted with the LFG implementation developed here specifically for database access. The implementation described here allows a natural language interface to a specific Prolog database to be produced from a set of grammar rule and lexical specifications in an LFG-like notation. In addition to this the interface system uses a simple database description to compile metadata about the database for later use in planning the execution of queries. Extensions to LFG's semantic component are shown to be necessary to produce a satisfactory functional analysis and semantic output for querying a database. A diverse set of natural language constructs are analysed using LFG and the derivation of Prolog queries from the F-structure output of LFG is illustrated. The functional description produced from LFG is proposed as sufficient for resolving many problems of quantification and attachment

    Chart parsing in Prolog

    No full text
    Several differing approaches to parsing using Prolog are discussed and their characteristics outlined, in particular Definite Clause Grammar (DCG), the Bottom-Up Parser (BUP) and the Active Chart Parser. Attention is paid to the conflict that arises between the simplicity and efficiency of the parsing algorithm when using a grammar specified as a linguistic, rather than computationally efficient, description of a sublanguage. A simple and efficient parsing algorithm called ‘Word Incorporation’ is described. Its efficient implementation in Prolog and extensions for handing literals, the Kleene star operator and gaps in grammar rules are described using experience gained with the unification-based formalism, Lexical Functional Grammar (LFG)

    Outcomes in Newly Diagnosed Atrial Fibrillation and History of Acute Coronary Syndromes: Insights from GARFIELD-AF

    No full text
    BACKGROUND: Many patients with atrial fibrillation have concomitant coronary artery disease with or without acute coronary syndromes and are in need of additional antithrombotic therapy. There are few data on the long-term clinical outcome of atrial fibrillation patients with a history of acute coronary syndrome. This is a 2-year study of atrial fibrillation patients with or without a history of acute coronary syndromes

    Analysis of Outcomes in Ischemic vs Nonischemic Cardiomyopathy in Patients With Atrial Fibrillation A Report From the GARFIELD-AF Registry

    No full text
    IMPORTANCE Congestive heart failure (CHF) is commonly associated with nonvalvular atrial fibrillation (AF), and their combination may affect treatment strategies and outcomes
    corecore